Compact Representation of Domain Parameters of Hyperelliptic Curve Cryptosystems
نویسندگان
چکیده
To achieve the same level of security, hyperelliptic curve cryptosystems (HCC) use a smaller field than elliptic curve cryptosystems (ECC). HCC has a more potential application to the product that has limited memory and computing power, for instance Smart cards. We discussed how to represent the domain parameters of HCC in a compact way. The domain parameters include the field over which the curve is defined, the curve itself, the order of the Jocobian and the base point. In our method, the representation of HCC with genus g=4 over F241 (It can provide the same level of security with 164 bits ECC) only uses 339 bits.
منابع مشابه
Hyperelliptic Curve Cryptography
The use of elliptic-curve groups in cryptography, suggested by Miller [1] and Koblitz [2] three decades ago,provides the same level of security for the Discrete Logarithm Problem as multiplicative groups, with much smallerkey sizes and parameters. The idea was refined two years later by Koblitz, who worked with the group formed bythe points of the Jacobian of hyperelliptic curve...
متن کاملSoftware and hardware implementation of hyperelliptic curve cryptosystems
The hyperelliptic curve cryptosystem is one of the emerging cryptographic primitives of the last years. This system offers the same security as established public-key cryptosystems, such as those based on RSA or elliptic curves, with much shorter operand length. Consequently, this system allows highly efficient computation of the underlying field arithmetic. However, until recently the common b...
متن کاملComparative Analysis of Higher Genus Hyperelliptic Curve Cryptosystems over Finite Field Fp
The performance analysis of Hyperelliptic Curve Cryptosystems (HECC) over prime fields (Fp) of genus 5 and 6 are discussed in this paper. We have implemented a HECC system of genus 5 & 6 in a Intel Pentium III Celeron Processor @ 933 MHz speed with 256 MB RAM in Java 1.5. We have also compared their efficiency on the parameters of time taken for divisor generation, key generation, encryption an...
متن کاملHyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves (Update)
For most of the time since they were proposed, it was widely believed that hyperelliptic curve cryptosystems (HECC) carry a substantial performance penalty compared to elliptic curve cryptosystems (ECC) and are, thus, not too attractive for practical applications. Only quite recently improvements have been made, mainly restricted to curves of genus 2. The work at hand advances the state-of-thea...
متن کاملInvalid-curve attacks on (hyper)elliptic curve cryptosystems
We extend the notion of an invalid-curve attack from elliptic curves to genus 2 hyperelliptic curves. We also show that invalid singular (hyper)elliptic curves can be used in mounting invalid-curve attacks on (hyper)elliptic curve cryptosystems, and make quantitative estimates of the practicality of these attacks. We thereby show that proper key validation is necessary even in cryptosystems bas...
متن کامل